From Crisp to Fuzzy Constraint Networks
نویسنده
چکیده
Several instances of the CSP framework have been proposed to handle specific problems, such as temporal and spatial reasoning formalisms. This paper, standing at a high level of abstraction, studies the problem of extending these specific instances in order to handle fuzzy constraints. The concepts of class of networks, property, algorithm and the relevant fuzzy extensions are defined. Some application examples in the field of temporal reasoning are provided.
منابع مشابه
Profit maximization solid transportation problem under budget constraint using fuzzy measures
Fixed charge solid transportation problems are formulated as profit maximization problems under a budget constraint at each destination. Here item is purchased in different depots at different prices. Accordingly the item is transported to different destinations from different depots using different vehicles. Unitsare sold from different destinations to the customers at different selling prices...
متن کاملFuzzy Constraint Problems with General Aggregation Operations under Possibilistic Logic Form
In Fuzzy constraints satisfaction problem (FCSP), fuzzy constraints are aggregated by min operation into a fuzzy set membership function to be maximized. This representation framework, originally expressed in terms of membership functions, can be equivalently translated into a set of prioritized crisp constraints. We take advantage of this representation for modeling aggregations different from...
متن کاملThe Fuzziness of Fuzzy Ideals
The backing of the fuzzy ideal is normal ideal in some ring and in same time there fuzzy set whose is not fuzzy ideal and it backing set is ideal, i.e., it crisp is normal ideal. Consequently, in this paper we constructing a fuzziness function which defined on fuzzy sets and assigns membership grade for every fuzzy set whose it backing set are crisp ideal. Now, Let be collection of all fuzzy s...
متن کاملA CONSTRAINED SOLID TSP IN FUZZY ENVIRONMENT: TWO HEURISTIC APPROACHES
A solid travelling salesman problem (STSP) is a travelling salesman problem (TSP) where the salesman visits all the cities only once in his tour using dierent conveyances to travel from one city to another. Costs and environmental eect factors for travelling between the cities using dierent conveyances are dierent. Goal of the problem is to nd a complete tour with minimum cost that damages the ...
متن کاملIncorporating Return on Inventory Investment into Joint Lot-Sizing and Price Discriminating Decisions: A Fuzzy Chance Constraint Programming Model
Coordination of market decisions with other aspects of operations management such as production and inventory decisions has long been a meticulous research issue in supply chain management. Generally, changes to the original lot-sizing policy stimulated by market prices may impose remarkable deviation revenue throughout the supply and demand chain system. This paper examines how to set the chan...
متن کامل